Reasoning about probabilistic sequential programs 1
نویسندگان
چکیده
A complete and decidable Hoare-style calculus for iteration-free probabilistic sequential programs is presented using a state logic with truth-functional propositional (not arithmetical) connectives.
منابع مشابه
Developing and Reasoning About Probabilistic Programs in pGCL
As explained in Chapter 1, Dijkstra’s guarded-command language, which we call GCL, was introduced as an intellectual framework for rigorous reasoning about imperative sequential programs; one of its novelties was that it contained explicit “demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nonde...
متن کاملReasoning About States of Probabilistic Sequential Programs
A complete and decidable propositional logic for reasoning about states of probabilistic sequential programs is presented. The state logic is then used to obtain a sound Hoare-style calculus for basic probabilistic sequential programs. The Hoare calculus presented herein is the first probabilistic Hoare calculus with a complete and decidable state logic that has truth-functional propositional (...
متن کاملReasoning about probabilistic sequential programs
A complete and decidable Hoare-style calculus for iteration-free prob-abilistic sequential programs is presented using a state logic with truth-functional propositional (not arithmetical) connectives.
متن کاملReasoning about efficiency within a probabilistic µ-calculus
Expectation-based probabilistic predicate transformers 15] provide a logic for probabilistic sequential programs, giving access to expressions such as`the probability that predicate A is achieved nally'. Using expectations more generally however, we can express-calculus formulae for the expected path-length of a computation tree. Moreover within an expectation-based-calculus such eeciency measu...
متن کاملReasoning about reasoning by nested conditioning: Modeling theory of mind with probabilistic programs
A wide range of human reasoning patterns can be explained as conditioning in probabilistic models; however, conditioning has traditionally been viewed as an operation applied to such models, not represented in such models. We describe how probabilistic programs can explicitly represent conditioning as part of a model. This enables us to describe reasoning about others’ reasoning using nested co...
متن کامل